A Tabu Scatter Search Metaheuristic for the Arc Routing Problem
نویسنده
چکیده
We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles which is located at a single depot node. We present a metaheuristic based on a Tabu Search procedure that makes use of the Scatter Search paradigm. The computational results indicate that the algorithms proposed can keep up with other arc routing heuristics.
منابع مشابه
A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملExperimental Investigation of Scatter Search for Graph Coloring
Scatter search [9, 10] is an evolutionary approach related to the tabu search metaheuristic [8]. It is based on strategies proposed in the 1960s for combining decision rules and constraints. This approach has only been applied recently to a few optimization problems. Applications of this method include, for instance, vehicle routing [20] and unconstrained optimization [17]; see also [9] for mor...
متن کاملThe Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem
In this paper, we introduce a multi vehicle version of the Time-Dependent PrizeCollecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real-life traffic situations where the travel times change with the time of day are taken into account. T...
متن کاملA hybrid metaheuristic approach for the capacitated arc routing problem
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has been intensively studied in the last decades. We present a hybrid metaheuristic approach (HMA) to solve this problem which incorporates an effective local refinement procedure, coupling a randomized tabu thresholding procedure with an infeasible descent procedure, into the memetic framework. Ot...
متن کامل